-
1 path-balanced graph
Большой англо-русский и русско-английский словарь > path-balanced graph
-
2 path-balanced graph
Математика: сбалансированный по путям граф -
3 path-balanced graph
-
4 graph
1) граф2) график || строить график3) диаграмма || чертить диаграмму•- alternating composition graph - arbitrarily transversable graph - derived graph - doubly connected graph - doubly transitive graph - fully connected graph - locally countable graph - locally finite graph - locally restricted graph - log-log graph - partially labeled graph - partially orderable graph - progressively finite graph - regressively finite graph - strictly weak graph - strongly orientable graph - strongly regular graph - strongly rigid graph - strongly singular graph - strongly smooth graph - totally inductive graph - triangleless graph - triply transitive graph - uniquely intersectable graph - uniquely representable graph - weakly disconnected graph -
5 path
1) путь; трасса2) траектория3) канал; тракт4) дорожка ( магнитной ленты)5) вчт ветвь (программы)6) цепь ( в электрической схеме)7) путь доступа8) контур•- path of a projectile- ray path -
6 method
1) метод; приём; способ2) методика3) технология4) система•- accelerated strength testing method-
benching method-
bullhead well control method-
electrical-surveying method-
electromagnetic surveying method-
long-wire transmitter method-
operational method-
rule of thumb method-
straight flange method of rolling beams-
symbolical method-
tee-test method-
testing method-
triangulation method-
value-iteration method -
7 method
метод; процедура; способ- antithetic variate method - average ordinate method - average range method - binary search method - conjugate directions method - conjugate gradient method - control chart method - conventional milling method - correlation function method - decision function method - differential control method - Feynman diagram method - first approximation method - gradient projection method - iterative method - large sample method - large sieve method - least-squares regression method - less than fully efficient method - linearly implicit method - method of adjoint gradient - method of algebraic addition - method of alternating directions - method of balanced blocks - method of complex numbers - method of confidence intervals - method of conformal mappings - method of conjugate directions - method of conjugate gradients - method of cyclic descent - method of detached coefficients - method of disjunction of cases - method of divided differences - method of electrical images - method of elimination of quantifiers - method of empty ball - method of extreme values - method of false position - method of feasible directions - method of finite differences - method of first approximation - method of first entrance - method of fitting constants - method of fixed points - method of full enumeration - method of generating functions - method of geometric exhaustion - method of indefinite coefficients - method of infinite descent - method of interval bisection - method of least absolute values - method of least distance - method of least likelihood - method of maximum likelihood - method of means and standard deviations - method of medians and extreme values - method of minimal change - method of minimal variance - method of mirror reflections - method of moving frame - method of multiple comparison - method of orthogonal projections - method of paired associates - method of paired comparisons - method of phase integrals - method of projecting cones - method of proportional parts - method of rotating factors - method of semantic tableaux - method of separation of variables - method of simulaneous displacements - method of stationary phase - method of statistical differentials - method of statistical inference - method of steep variations - method of steepest ascent - method of stochastic approximation - method of straightforward iteration - method of successive displacements - method of successive divisions - method of successive elimination - method of transfinite induction - method of unweighted means - method of variable differences - method of variation of parameters - method of weighted residuals - optimum method - parallel tangents method - precision method - random walk method - recursive method - reduced gradient method - reflected wave method - relative method of measurement - sampling method by variables - statistical sampling method - steepest descent method - time average method
См. также в других словарях:
Glossary of graph theory — Graph theory is a growing area in mathematical research, and has a large specialized vocabulary. Some authors use the same word with different meanings. Some authors use different words to mean the same thing. This page attempts to keep up with… … Wikipedia
Biased graph — In mathematics, a biased graph is a graph with a list of distinguished circles (edge sets of simple cycles), such that if two circles in the list are contained in a theta graph, then so is the third circle of the theta graph. A biased graph is a… … Wikipedia
Signed graph — In the area of graph theory in mathematics, a signed graph is a graph in which each edge has a positive or negative sign.Formally, a signed graph Sigma; is a pair ( G , sigma;) that consists of a graph G = ( V , E ) and a sign mapping or… … Wikipedia
Directed graph — A directed graph. A directed graph or digraph is a pair G = (V,A) (sometimes G = (V,E)) of:[1] a set V, whose elements are called vertices or … Wikipedia
List of NP-complete problems — Here are some of the more commonly known problems that are NP complete when expressed as decision problems. This list is in no way comprehensive (there are more than 3000 known NP complete problems). Most of the problems in this list are taken… … Wikipedia
Liste De Problèmes NP-Complets — Ceci est une liste des problèmes NP complets les plus connus en théorie de la complexité des algorithmes, exprimés sous la forme d un problèmes de la décision. Puisqu on connaît plus de 3000 problèmes NP complets, cette liste n est pas exhaustive … Wikipédia en Français
Liste de problemes NP-complets — Liste de problèmes NP complets Ceci est une liste des problèmes NP complets les plus connus en théorie de la complexité des algorithmes, exprimés sous la forme d un problèmes de la décision. Puisqu on connaît plus de 3000 problèmes NP complets,… … Wikipédia en Français
Liste de problèmes NP-complets — Ceci est une liste des problèmes NP complets les plus connus en théorie de la complexité des algorithmes, exprimés sous la forme d un problème de décision. Puisqu on connaît plus de 3000 problèmes NP complets, cette liste n est pas exhaustive. La … Wikipédia en Français
Liste de problèmes np-complets — Ceci est une liste des problèmes NP complets les plus connus en théorie de la complexité des algorithmes, exprimés sous la forme d un problèmes de la décision. Puisqu on connaît plus de 3000 problèmes NP complets, cette liste n est pas exhaustive … Wikipédia en Français
Iterative deepening depth-first search — Graph and tree search algorithms Alpha beta pruning A* B* Beam Bellman–Ford algorithm Best first Bidirectional … Wikipedia
List of terms relating to algorithms and data structures — The [http://www.nist.gov/dads/ NIST Dictionary of Algorithms and Data Structures] is a reference work maintained by the U.S. National Institute of Standards and Technology. It defines a large number of terms relating to algorithms and data… … Wikipedia
